Reformulation-Linearization Methods for Global Optimization
نویسندگان
چکیده
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and nonlinear programming problems, as well as polyhedral outer-approximation methods for continuous nonconvex programming problems. At the heart of these approaches is a sequence of linear (or convex) programming relaxations that drive the solution process, and the success of such algorithms is strongly tied in with the strength or tightness of these relaxations.
منابع مشابه
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based on semidefinite programming (SDP) and the reformulation-linearization technique (RLT). From a theoretical standpoint we show that the addition of a semidefiniteness condition removes a substantial portion of the feasible region corresponding to product terms in the RLT relaxation. On test problems...
متن کاملA reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
In this paper, an algorithm is introduced to find an optimal solution for an optimization problem that arises in total least squares with inequality constraints, and in the correction of infeasible linear systems of inequalities. The stated problem is a nonconvex program with a special structure that allows the use of a reformulation–linearization–convexification technique for its solution. A b...
متن کاملConvex Relaxation Methods for Nonconvex Polynomial Optimization Problems
This paper introduces to constructing problems of convex relaxations for nonconvex polynomial optimization problems. Branch-and-bound algorithms are convex relaxation based. The convex envelopes are of primary importance since they represent the uniformly best convex underestimators for nonconvex polynomials over some region. The reformulationlinearization technique (RLT) generates LP (linear p...
متن کاملAn Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms
Abstract. Many nonconvex nonlinear programming (NLP) problems of practical interest involve bilinear terms and linear constraints, as well as, potentially, other convex and nonconvex terms and constraints. In such cases, it may be possible to augment the formulation with additional linear constraints (a subset of Reformulation-Linearization Technique constraints) which do not affect the feasibl...
متن کاملThe Reformulation-based αGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements
The α-reformulation (αR) technique can be used to transform any nonconvex twice-differentiable mixedinteger nonlinear programming problem to a convex relaxed form. By adding a quadratic function to the nonconvex function it is possible to convexify it, and by subtracting a piecewise linearization of the added function a convex underestimator will be obtained. This reformulation technique is imp...
متن کامل